Explicit representation of structurally finite entire functions
نویسندگان
چکیده
منابع مشابه
Growth analysis of entire functions of two complex variables
In this paper, we introduce the idea of generalized relative order (respectively generalized relative lower order) of entire functions of two complex variables. Hence, we study some growth properties of entire functions of two complex variables on the basis of the definition of generalized relative order and generalized relative lower order of entire functions of two complex variables.
متن کاملExplicit Representation of Finite Predictor Coefficients and Its Applications
We consider the finite-past predictor coefficients of stationary time series, and establish an explicit representation for them, in terms of the MA and AR coefficients. The proof is based on the alternate applications of projection operators associated with the infinite past and the infinite future. Applying the result to long memory processes, we give the rate of convergence of the finite pred...
متن کاملDynamics of Entire Functions
Complex dynamics of iterated entire holomorphic functions is an active and exciting area of research. This manuscript collects known background in this field and describes several of the most active research areas within the dynamics of entire functions. Complex dynamics, in the sense of holomorphic iteration theory, has been a most active research area for the last three decades. A number of i...
متن کاملCoupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کاملStructurally Unambiguous Finite Automata
We define a structurally unambiguous finite automaton (SUFA) to be a nondeterministic finite automaton (NFA) with one starting state q0 such that for all input strings w and for any state q, there is at most one path from q0 to q that consumes w. The definition of SUFA differs from the usual definition of an unambiguous finite automaton (UFA) in that the new definition is defined in terms of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 2001
ISSN: 0386-2194
DOI: 10.3792/pjaa.77.68